Weighted Optimal Path in Graph with Multiple Indexes
نویسندگان
چکیده مقاله:
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment Analysis (DEA) technique for designing a model that can identify optimal paths with multiple indexes, and separate them from the other paths.
منابع مشابه
Mining Weighted Frequent Patterns from Path Traversals on Weighted Graph
A lot of real world problems can be modeled as traversals on graph, and mining from such traversals has been found useful in several applications. However, previous works considered only traversals on unweighted graph. This paper generalizes this to the case where vertices of graph are given weights to reflect their importance. Under such weight settings, traditional mining algorithms can not b...
متن کاملFinding Optimal-Path Maps for Path Planning across Weighted Regions
Optimal-path maps tell robots or people the best way to reach a goal point from anywhere in a known terrain area, eliminating most of the need to plan during travel. The authors address the construction of optimal-path maps for two-dimensional polygonal weighted-region terrain, terrain partitioned into polygonal areas such that the cost per unit of distance traveled is homogeneous and isotropic...
متن کاملOptimal Path and Minimal Spanning Trees in Random Weighted Networks
We review results on the scaling of the optimal path length lopt in random networks with weighted links or nodes. We refer to such networks as “weighted” or “disordered” networks. The optimal path is the path with minimum sum of the weights. In strong disorder, where the maximal weight along the path dominates the sum, we find that lopt increases dramatically compared to the known small world r...
متن کاملThe Optimal Path in an Erdős-Rényi Random Graph
We study the optimal distance opt in random networks in the presence of disorder implemented by assigning random weights to the links. The optimal distance between two nodes is the length of the path for which the sum of weights along the path (“cost”) is a minimum. We study the case of strong disorder for which the distribution of weights is so broad that its sum along any path is dominated by...
متن کاملDynamic Optimal Path Selection for 3D Triangulation with Multiple Cameras
When a physical feature is observed by two or more cameras, its position in the 3D space can be easily recovered by means of triangulation. However, for such estimate to be reliable, accurate intrinsic and extrinsic calibration of the capturing devices must be available. Extrinsic parameters are usually the most problematic, especially when dealing with a large number of cameras. This is due to...
متن کاملAdaptive and Compact Discretization for Weighted Region Optimal Path Finding
This paper presents several results on the weighted region optimal path problem. An often-used approach to approximately solve this problem is to apply a discrete search algorithm to a graph G2 generated by a discretization of the problem; this graph guarantees to contain an 2-approximation of an optimal path between given source and destination points. We first provide a discretization scheme ...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 2 شماره 7
صفحات 5- 12
تاریخ انتشار 2016-12-10
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023